Optimal CNN Templates for Linearly-Separable One-Dimensional Cellular Automata
نویسندگان
چکیده
In this tutorial, we present optimal Cellular Nonlinear Network (CNN) templates for implementing linearly-separable one-dimensional (1-D) Cellular Automata (CA). From the gallery of CNN templates presented in this paper, one can calculate any of the 256 1-D CA Rules studied by Wolfram using a CNN Universal Machine chip that is several orders of magnitude faster than conventional programming on a digital computer.
منابع مشابه
Realization and bifurcation of Boolean Functions via Cellular Neural Networks
In this work, we study the realization and bifurcation of Boolean functions of four variables via a Cellular Neural Network (CNN). We characterize the basic relations between the genes and the offsets of an uncoupled CNN as well as the basis of the binary input vectors set. Based on the analysis, we have rigorously proved that there are exactly 1882 linearly separable Boolean functions of four ...
متن کاملImplementing Universal CNN Neuron
The universal CNN neuron can realize arbitrary Boolean functions including both linearly separable Boolean functions (LSBF) and linearly not separable Boolean functions (non-LSBF). However, determining the optimal (or near-optimal) orientation vector and the parameters in the multi-nested discriminant function contained within a universal CNN neuron is still a difficult task. By the aid of the ...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملOn the Templates Corresponding to Cycle-Symmetric Connectivity in Cellular Neural Networks
In the architecture of cellular neural networks (CNN), connections among cells are built on linear coupling laws. These laws are characterized by the so-called templates which express the local interaction weights among cells. Recently, the complete stability for CNN has been extended from symmetric connections to cycle-symmetric connections. In this presentation, we investigate a class of temp...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 17 شماره
صفحات -
تاریخ انتشار 2007